Abstract: A minimum spanning tree is a spanning tree of a connected undirected graph. Each edge is labelled with its weight. It connects all the vertices together with the minimal total weight for its edges. In this paper we designed an algorithm to find minimum weight spanning tree.

Keywords: Spanning tree, minimum spanning tree, minimum weight.